Reasoning about Java classes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reasoning about Pointer Structures in Java

Java programs often use pointer structures for normal computations. A verification system for Java should have good proof support for reasoning about those structures. However, the literature for pointer verification almost always uses specifications and definitions that are tailored to the problem under consideration. We propose a generic specification for Java pointer structures that allows t...

متن کامل

Reasoning about Classes in Object - OrientedLanguages :

c) restricts to an operation of type [(P )! AbstractIFace[(P ); ]]. Of course, it has to be proven that the model satis es the assertions and creationconditions of the abstract class, as expressed by the following lemma. Abstract_refine : LEMMA AbstractAssert?(abstract(c)) AND AbstractCreate?(abstract(c))(new) As an example, we can prove that DoubleCounter with parameter n re nes a counter modu...

متن کامل

Reasoning about Card Tears and Transactions in Java Card

The Java dialect Java Card for programming smartcards contains some features which do not exist in Java. Java Card distinguishes persistent and transient data (data stored in EEPROM and RAM, respectively). Because power to a smartcard can suddenly be interrupted by a so-called card tear, by someone removing the smartcard from the reader, Java Card provides a notion of transaction to ensure that...

متن کامل

Algebraic Java classes for optimization

Our software, Jest , comprises a general and extendible library for numerical optimization for science and engineering, Jam , and a particular extension of that framework for seismic image processing, Jag. Jest successfully separates optimization and application software without imposing limitations on an application’s vector representation, on an application’s operator implementation, or on a ...

متن کامل

Updates by Reasoning about States Updates by Reasoning about States *

We present a language extension to Datalog which allows to specify deterministic update procedures in a declarative way. Existing update languages either rely on procedural aspects of program evaluation or leave the framework of deductive databases and logic programming. In contrast, we show that declarative update semantics can be attained by incorporating state terms into the language. Since ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGPLAN Notices

سال: 1998

ISSN: 0362-1340,1558-1160

DOI: 10.1145/286942.286973